Efficient weighted expressions conversion

Adding pebbles to weighted automata: Easy specification & efficient evaluation

We extend weighted automata and weighted rational expressions with 2-way moves and (reusable) pebbles. We show with examples from natural language modeling and quantitative model-checking that weighted expressions and automata with pebbles are more expressive and allow much more natural and intuitive specifications than classical ones. We extend Kleene-Schützenberger theorem showing that weight...

Adding Pebbles to Weighted Automata

We extend weighted automata and weighted rational expressions with 2-way moves and (reusable) pebbles. We show with examples from natural language modeling and quantitative model-checking that weighted expressions and automata with pebbles are more expressive and allow much more natural and intuitive specifications than classical ones. We extend Kleene-Schützenberger theorem showing that weight...

A Multiplier - Free Residue to Weighted Converter for the Moduli Set { 3 n – 2 , 3 n – 1 , 3 n }

The residue number system (RNS) is a carry-free number system which can support high-speed and parallel arithmetic. One of the major issues in efficient design of RNS systems is the residue to weighted conversion. In this paper, we present an efficient design of residue to weighted converter for the newly introduced moduli set {3–2, 3–1, 3}, based on mixed-radix conversion (MRC) algorithm. The ...

Developing Efficient Encodings for Weighted Expressions in Answer Set Programs

Algorithms for Glushkov K-graphs

The automata arising from the well known conversion of regular expression to non deterministic automata have rather particular transition graphs. We refer to them as the Glushkov graphs, to honour his nice expression-to-automaton algorithmic short cut [10]. The Glushkov graphs have been characterized [6] in terms of simple graph theoretical properties and certain reduction rules. We show how to...